Computable Information Content and Boolean Networks Dynamics

نویسندگان

Claudio Bonanno

Giulia Menconi

Vieri Benci

Paola Cerrai

چکیده

We propose the application of information content to analyze the time and space evolution of some boolean networks, and to give a classification of their state as either solid, jelly, liquid, or gaseous, following the ideas of Kauffman. To these aims both individual nodes and the global network are studied by means of data compression. Some experiments are presented using the compression algorithm CASToRe, developed along Lempel–Ziv algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balance between Noise and Information Flow Maximizes Set Complexity of Network Dynamics

Boolean networks have been used as a discrete model for several biological systems, including metabolic and genetic regulatory networks. Due to their simplicity they offer a firm foundation for generic studies of physical systems. In this work we show, using a measure of context-dependent information, set complexity, that prior to reaching an attractor, random Boolean networks pass through a tr...

متن کامل

XCS with Computable Prediction for the Learning of Boolean Functions

Computable prediction represents a major shift in learning classifier system research. XCS with computable prediction, based on linear approximators, has been applied so far to function approximation problems and to single step problems involving continuous payoff functions. In this paper we take this new approach in a different direction and apply it to the learning of Boolean functions – a do...

متن کامل

DRAFT—NOT FOR PUBLIC CIRCULATION Date: 2004/09/25 00:18:56; Revision: 1.90.2.3 Computation in Networks of Passively Mobile Finite-State Sensors

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size are defined. With a fairness condition on interactions, the concept of stable computation of a function or predicate is defined. Protocols are given that stably compute any predica...

متن کامل

Connections between Neural Networks and Boolean Functions∗

This report surveys some connections between Boolean functions and artificial neural networks. The focus is on cases in which the individual neurons are linear threshold neurons, sigmoid neurons, polynomial threshold neurons, or spiking neurons. We explore the relationships between types of artificial neural network and classes of Boolean function. In particular, we investigate the type of Bool...

متن کامل